On the hierarchy of Petri net languages

Petri Net Languages and Infinite Subsets of

Families of Petri net languages are usually defined by varying the type of transition labeling and the class of subsets of N to be used as sets of final markings (m is the number of places). So far three main classes of subsets have been studied: the trivial class containing as single element N, the class of finite subsets of N, and the class of ideals (or covering subsets) of N. In this paper ...

Petri Net Languages and Innnite Subsets of N M Proposed Running Head

Families of Petri net languages are usually de ned by varying the type of transition labeling and the class of subsets of Nm to be used as sets of nal markings (m is the number of places). So far three main classes of subsets have been studied: the trivial class containing as single element Nm , the class of nite subsets of Nm , and the class of ideals (or covering subsets) of Nm . In this pape...

The Object Orientation of Object Petri Nets

This paper informally introduces Object Petri Nets (OPNs) with a number of examples and discusses how this kind of Petri Net addresses a number of issues pertinent to Concurrent Object-Oriented Programming Languages. OPNs support a thorough integration of object-oriented concepts into Petri Nets, including inheritance and the associated polymorphism and dynamic binding. They have a single class...

The Wadge Hierarchy of Petri Nets ω-Languages

We describe the Wadge hierarchy of the ω-languages recognized by deterministic Petri nets. This is an extension of the celebrated Wagner hierarchy which turned out to be the Wadge hierarchy of the ω-regular languages. Petri nets are more powerful devices than finite automata. They may be defined as partially blind multi-counter automata. We show that the whole hierarchy has height ω 2 , and giv...

The Wadge Hierarchy of Petri Nets omega-Languages